Matching and Segregation: an Experimental Study

نویسندگان

  • Yan Chen
  • Ernst Fehr
  • Urs Fischbacher
  • Peter Morgan
چکیده

Social segregation is a ubiquitous feature of human life. People segregate along the lines of income, religion, ethnicity, language, race, and other characteristics. This study provides the first experimental examination of decentralized matching with search frictions and institutionalized segregation. The findings indicate that, without a segregation institution, high types over-segregate relative to the equilibrium prediction. We observe segregation attempts even when equilibrium suggests that everyone should accept everyone else. In the presence of a segregation institution, high types successfully segregate themselves from low types in most sessions, despite chasing behavior of some low types. However, high type over-segregation behavior destroys the efficiency gain from the segregation institution.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Segregation patterns of an equidensity TiO2 ternary mixture in a conical fluidized bed: CFD and experimental study

In this study, an Eulerian-Eulerian multi-fluid model (MFM) was used to simulate the segregation pattern of a conical fluidized bed containing ternary mixtures of equidensity TiO2‌ particles. Experimental 'freeze–sieving' method was employed to determine the axial mass fraction profiles of the different-sized particles, and validate the simulation results. The profiles of mass fraction for larg...

متن کامل

A Novel Assisted History Matching Workflow and its Application in a Full Field Reservoir Simulation Model

The significant increase in using reservoir simulation models poses significant challenges in the design and calibration of models. Moreover, conventional model calibration, history matching, is usually performed using a trial and error process of adjusting model parameters until a satisfactory match is obtained. In addition, history matching is an inverse problem, and hence it may have non-uni...

متن کامل

An Efficient Adaptive Boundary Matching Algorithm for Video Error Concealment

Sending compressed video data in error-prone environments (like the Internet and wireless networks) might cause data degradation. Error concealment techniques try to conceal the received data in the decoder side. In this paper, an adaptive boundary matching algorithm is presented for recovering the damaged motion vectors (MVs). This algorithm uses an outer boundary matching or directional tempo...

متن کامل

Vehicle Logo Recognition Using Image Matching and Textural Features

In recent years, automatic recognition of vehicle logos has become one of the important issues in modern cities. This is due to the unlimited increase of cars and transportation systems that make it impossible to be fully managed and monitored by human. In this research, an automatic real-time logo recognition system for moving cars is introduced based on histogram manipulation. In the proposed...

متن کامل

ON THE MATCHING NUMBER OF AN UNCERTAIN GRAPH

Uncertain graphs are employed to describe graph models with indeterministicinformation that produced by human beings. This paper aims to study themaximum matching problem in uncertain graphs.The number of edges of a maximum matching in a graph is called matching numberof the graph. Due to the existence of uncertain edges, the matching number of an uncertain graph is essentially an uncertain var...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005